package problem35;

//35.搜索插入位置
//https://leetcode.cn/problems/search-insert-position/

class Solution {
    public int searchInsert(int[] nums, int target) {
        int left = 0, right = nums.length-1;
        while(left < right) {
            int mid = left + (right - left) / 2;
            if(nums[mid] < target) {
                left = mid+1;
            }else {
                right = mid;
            }
        }
        if(nums[left] < target) return left+1;
        else return left;
    }
}